Solving an integrated scheduling and routing problem with inventory, routing and penalty costs

This paper considers an integrated routing and scheduling problem where the part takes into account costs tardiness penalties is modelled by a permutation flow shop with inventory costs. We assume that each batch served dedicated vehicle, number of batches their compositions (the jobs parameters those jobs) are known in advance. The to determine starting times on machine shop, departure dates delivery route, such total cost (sum inventory, penalty costs) minimised. A two-step approach proposed. In first step, optimal routes for possible date calculated. as determining min route particular easy. second we use function batch, depending date, from find schedule minimises cost. Computational experiments performed randomly generated instances.